Uniform behaviors of random polytopes under the Hausdorff metric
نویسندگان
چکیده
منابع مشابه
The Hausdorff fuzzy quasi-metric
Removing the condition of symmetry in the notion of a fuzzy (pseudo)metric, in Kramosil and Michalek’s sense, one has the notion of a fuzzy quasi-(pseudo-)metric. Then for each fuzzy quasi-pseudo-metric on a set X we construct a fuzzy quasipseudo-metric on the collection of all nonempty subsets of X, called the Hausdorff fuzzy quasi-pseudo-metric. We investigate several properties of this struc...
متن کاملHausdorff approximation of 3D convex polytopes
Let P be a convex polytope in R, d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm selects k < n vertices of P whose convex hull is the approximating polytope. The rate of approximation, in the Hausdorff distance sense, is best possible in the worst case. An analogous algorithm, where the role of vertices is...
متن کاملUniform Hyperspaces and Hausdorff Completions
We consider the uniform hyperspaces of a uniform space X, its associated Hausdorff space sX and its Hausdorff completion nX, and investigate the relationships between the functors s and n and the various hyperspace functors. Thus Theorem 1 says that there is a natural isomorphism between the functors TTE and TTETT, where ii'A'is the space of non-empty closed subsets of X, endowed with the Hausd...
متن کاملOn the metric dimension of convex polytopes ∗
Metric dimension is a generalization of affine dimension to arbitrary metric spaces (provided a resolving set exists). Let F be a family of connected graphs Gn : F = (Gn)n≥1 depending on n as follows: the order |V (G)| = φ(n) and lim n→∞ φ(n) = ∞ . If there exists a constant C > 0 such that dim(Gn) ≤ C for every n ≥ 1 then we shall say that F has bounded metric dimension. If all graphs in F hav...
متن کاملRandom polytopes
We prove the central limit theorem for the volume and the f -vector of the random polytope Pn and the Poisson random polytope Πn in a fixed convex polytope P ⊂ IR. Here Pn is the convex hull of n random points in P , and Πn is the convex hull of the intersection of a Poisson process X(n), of intensity n, with P . A general lower bound on the variance is also proved. ∗Supported by Hungarian Nati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bernoulli
سال: 2019
ISSN: 1350-7265
DOI: 10.3150/18-bej1035